Fast Message Ordering and Membership Using a Logical Token-Passing Ring
نویسندگان
چکیده
Many protocols exist to support the maintenance of consistency of data in fault-tolerant distributed systems ; these protocols are quite expensive and thus have not been widely adopted. The Totem protocol supports consistent concurrent operations by placing a total order on broadcast messages. This total order is achieved by including a sequence number in a token circulated around a logical ring that is imposed on a set of processors in a broadcast domain. A membership algorithm handles reconnguration, including restarting of a failed processor and remerging of a partitioned network. EEective ow-control allows the protocol to achieve message ordering rates two to three times higher than the best prior protocols.
منابع مشابه
A Multicast Protocol Based on a Single Logical Ring Using a Virtual Token and Logical Clocks
A novel and efficient protocol based on a single logical ring for multicast communication among a group of processes is presented. The senders and receivers are merged in the same group and this peer group reflects a cooperative (mirror) group of information servers. The protocol maintains consistency in the group by using two strategies. First, by placing a total sequence number in each of the...
متن کاملA total ordering protocol using a dynamic token-passing scheme
Solutions to the total ordering problem can be used to maintain consistency in distributed system applications such as replicated databases. We propose a total ordering protocol based on a dynamic token-passing scheme which determines the next token holder dynamically, not in predetermined order. The proposed protocol provides fast stability time, uses a small buffer, and distributes evenly the...
متن کاملAn Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملSelf-Stabilizing Token Circulation on Anonymous Message Passing Rings
A self-stabilizing algorithm that solves the problems of token circulation and leader election on anonymous and uniform, unidirectional, message passing rings of arbitrary, but known, size is developed. From any initial configuration, the expected time to stabilization on a ring of size n is in O(n log n). Furthermore, the size of the configuration of the system remains constant throughout the ...
متن کاملDeveloping and Refining an Adaptive Token-Passing Strategy
Token rotation algorithms play an important role in distributed computing, to support such activities as mutual exclusion, round-robin scheduling, group membership and group communication protocols. Ring-based protocols maximize throughput in busy systems, but can incur a linear, in the number of processors, delay when a processor needs to obtain a token to perform an operation. This paper synt...
متن کامل